Finitely stable racks and rack representations
نویسندگان
چکیده
منابع مشابه
Constructing Matrix Representations of Finitely Presented Groups
The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...
متن کاملAnalysing Finitely Presented Groups by Constructing Representations
One idea how to prove that a finitely presented group G is infinite is to construct suitable homomorphisms into infinite matrix groups. In [HoP 92] this is done by starting with a finite image H of G and solving linear equations to check whether the epimorphism onto H can be lifted to a representation whose image is an extension of a ZZ-lattice by H, thus exhibiting an infinite abelian section ...
متن کاملOn Some Finitely Based Representations Of Semigroups
In this paper we present a method of obtaining finitely based linear representations of possibly infinitely based semigroups. Let R{x1, x2, . . . } be a free associative algebra over a commutative ring R with the countable set of free generators {x1, x2, . . . }. An endomorphism α of R{x1, x2, . . . } is called a semigroup endomorphism if x1α, x2α, . . . are monomials (i.e. finite products of x...
متن کاملConstructing Irreducible Representations of Finitely Presented Algebras
We describe an algorithmic test, using the “standard polynomial identity” (and elementary computational commutative algebra), for determining whether or not a finitely presented associative algebra has an irreducible n-dimensional representation. When ndimensional irreducible representations do exist, our proposed procedure can (in principle) produce explicit constructions.
متن کاملPositive, Finitely Stable Arrows over Generic Homeomorphisms
Let us assume |Σθ,η| ≤ 0. Recent developments in advanced logic [3] have raised the question of whether α > ∫∫ a′′ ⋂
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2018
ISSN: 0092-7872,1532-4125
DOI: 10.1080/00927872.2018.1455102